Approximately optimal trees for group key management with batch updates
نویسندگان
چکیده
منابع مشابه
Approximately Optimal Trees for Group Key Management with Batch Updates
We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effective than individual rekeying. One model for batch rekeying is to assume that every user has probability p of being replaced by a new user during a batch period with the total number of users unchanged. Under this model, it was r...
متن کاملOptimal Tree Structures for Group Key Management with Batch Updates
We investigate the key management problem for broadcasting applications. Previous work showed that batch rekeying can be more cost-effective than individual rekeying. Under the assumption that every user has probability p of being replaced by a new user during a batch rekeying period, we study the structure of the optimal key trees. Constant bounds on both the branching degree and the subtree s...
متن کاملIdeal Drawings of Rooted Trees With Approximately Optimal Width
For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not known whether finding the minimum width is NPhard or polynomial. This paper gives a 2-approximation for this problem, and a 2∆-approximation (for ∆-ary trees) ...
متن کاملApproximately Optimal Teaching of Approximately Optimal Learners
We propose a method of generating teaching policies for use in intelligent tutoring systems (ITS) for concept learning tasks [37], e.g., teaching students the meanings of words by showing images that exemplify their meanings à la Rosetta Stone [30] and Duo Lingo [13]. The approach is grounded in control theory and capitalizes on recent work by [28], [29] that frames the “teaching” problem as th...
متن کاملGroup Key Management with Efficient Batch Rekeying in Mobile Ad-Hoc Network
A mobile ad-hoc network is a self configure network with dynamic infrastructure. The mobile network is self formed and self healing network. In MANET mobile nodes are connected by means of Wi-Fi, satellite transmission, etc to form a mobile network. Multi-hop technique is used while sending messages from source to sink; it also reduces delay in packet transferring. The path keeps on changing du...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.10.034